Are Chain-Complete Posets Co-wellpowered?
نویسندگان
چکیده
We show that the category CPO of chain-complete posets is not co-wellpowered but it weakly co-wellpowered. This implies nearly locally presentable.
منابع مشابه
Chain-complete posets and directed sets with applications
Let a poset P be called chain-complete when every chain, including the empty chain, has a sup in P. Many authors have investigated properties of posets satisfying some sort of chain-completeness condition (see [,11, [-31, [6], I-71, [17], [,181, ['191, [,211, [,221), and used them in a variety of applications. In this paper we study the notion of chain-completeness and demonstrate its usefulnes...
متن کاملFixpoint Theorem for Continuous Functions on Chain-Complete Posets
Let P be a non empty poset. Observe that there exists a chain of P which is non empty. Let I1 be a relational structure. We say that I1 is chain-complete if and only if: (Def. 1) I1 is lower-bounded and for every chain L of I1 such that L is non empty holds sup L exists in I1. One can prove the following proposition (1) Let P1, P2 be non empty posets, K be a non empty chain of P1, and h be a mo...
متن کاملMeet-continuity on $L$-directed Complete Posets
In this paper, the definition of meet-continuity on $L$-directedcomplete posets (for short, $L$-dcpos) is introduced. As ageneralization of meet-continuity on crisp dcpos, meet-continuity on$L$-dcpos, based on the generalized Scott topology, ischaracterized. In particular, it is shown that every continuous$L$-dcpo is meet-continuous and $L$-continuous retracts ofmeet-continuous $L$-dcpos are al...
متن کاملComplete Groups Are Complete Co-analytic
The set of complete groups is a complete co-analytic subset of the standard Borel space of countably infinite groups.
متن کاملM-chain graphs of posets
Covering graphs of various types of finite partially ordered sets have been extensively studied since Ore in [2] asked for a characterization of such graphs in general. In this note we introduce a graph, called the m-chain graph of a poset, that reduces to the covering graph when m = 1. Since we will show how to construct the m-chain graph for m > 2 as the 2-chain graph of another poset, we are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2021
ISSN: ['1572-9273', '0167-8094']
DOI: https://doi.org/10.1007/s11083-021-09567-2